91![CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximate Shortest Path Algorithms for Sequences of Pairwise Disjoint Simple Polygons Xiuxia Pan, Fajie Li∗ CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximate Shortest Path Algorithms for Sequences of Pairwise Disjoint Simple Polygons Xiuxia Pan, Fajie Li∗](https://www.pdfsearch.io/img/e5544632f46bef219d65583f2458e620.jpg) | Add to Reading ListSource URL: cccg.caLanguage: English - Date: 2010-07-19 10:46:18
|
---|
92![16th Canadian Conference on Computational Geometry, 2004 Efficient Polygon Enclosure Algorithms for Device Extraction from VLSI Layouts (Extended Abstract) Vamsi Krishna Kundeti 16th Canadian Conference on Computational Geometry, 2004 Efficient Polygon Enclosure Algorithms for Device Extraction from VLSI Layouts (Extended Abstract) Vamsi Krishna Kundeti](https://www.pdfsearch.io/img/a6ce69198267a45d359356a03ef07825.jpg) | Add to Reading ListSource URL: www.cccg.caLanguage: English - Date: 2004-08-23 15:27:23
|
---|
93![CCCG 2013, Waterloo, Ontario, August 8–10, 2013 An Efficient Exact Algorithm for the Natural Wireless Localization Problem∗ Bruno E. Crepaldi† Pedro J. de Rezende† CCCG 2013, Waterloo, Ontario, August 8–10, 2013 An Efficient Exact Algorithm for the Natural Wireless Localization Problem∗ Bruno E. Crepaldi† Pedro J. de Rezende†](https://www.pdfsearch.io/img/77c77374a0b766a91394a92fd5640c81.jpg) | Add to Reading ListSource URL: www.cccg.caLanguage: English - Date: 2013-08-11 21:51:57
|
---|
94![CCCG 2010, Winnipeg MB, August 9–11, 2010 Watchman Route in a Simple Polygon with a Rubberband Algorithm Fajie Li∗ CCCG 2010, Winnipeg MB, August 9–11, 2010 Watchman Route in a Simple Polygon with a Rubberband Algorithm Fajie Li∗](https://www.pdfsearch.io/img/4c81c27b46e22ab6ad2c86793cbe1c87.jpg) | Add to Reading ListSource URL: cccg.caLanguage: English - Date: 2010-07-19 10:46:14
|
---|
95![CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 An Implementation of a Linear Time Algorithm for Computing the Minimum Perimeter Triangle Enclosing a Convex Polygon Anna Medvedeva School of Computer Science CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 An Implementation of a Linear Time Algorithm for Computing the Minimum Perimeter Triangle Enclosing a Convex Polygon Anna Medvedeva School of Computer Science](https://www.pdfsearch.io/img/3f5a32bdeac87174a4a2b45ccc2579a7.jpg) | Add to Reading ListSource URL: www.cccg.caLanguage: English - Date: 2004-01-08 18:44:32
|
---|
96![Summer Lecture Series 2002 Dynamical Systems Model of the Simple Genetic Algorithm Introduction to Michael Vose’s Theory Summer Lecture Series 2002 Dynamical Systems Model of the Simple Genetic Algorithm Introduction to Michael Vose’s Theory](https://www.pdfsearch.io/img/e99e314ca462ef30cdecba435c9660d4.jpg) | Add to Reading ListSource URL: cs.gmu.eduLanguage: English - Date: 2007-06-21 16:40:24
|
---|
97![A fast and simple algorithm for training neural probabilistic language models Andriy Mnih Gatsby Computational Neuroscience Unit, University College London A fast and simple algorithm for training neural probabilistic language models Andriy Mnih Gatsby Computational Neuroscience Unit, University College London](https://www.pdfsearch.io/img/94873d8284fe847a7e3d3c22278e6c7a.jpg) | Add to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2012-05-21 13:59:03
|
---|
98![Simple Search Methods for Finding a Nash Equilibrium Ryan Porter and Eugene Nudelman and Yoav Shoham Computer Science Department Stanford University Stanford, CA 94305 {rwporter,eugnud,shoham}@cs.stanford.edu Simple Search Methods for Finding a Nash Equilibrium Ryan Porter and Eugene Nudelman and Yoav Shoham Computer Science Department Stanford University Stanford, CA 94305 {rwporter,eugnud,shoham}@cs.stanford.edu](https://www.pdfsearch.io/img/8a45e9bdbb9164ed7e76eda6b5829294.jpg) | Add to Reading ListSource URL: www.cs.ubc.caLanguage: English - Date: 2004-10-04 22:22:00
|
---|
99![Simple Polymorphic Usage Analysis
Simple Polymorphic Usage Analysis Simple Polymorphic Usage Analysis
Simple Polymorphic Usage Analysis](https://www.pdfsearch.io/img/c3ad46def37da71c366e00a1addc3c18.jpg) | Add to Reading ListSource URL: www.lochan.orgLanguage: English - Date: 2005-03-28 17:24:02
|
---|
100![A simple D 2 -sampling based PTAS for k-means and other Clustering problems Ragesh Jaiswal1 , Amit Kumar1 , and Sandeep Sen1 Department of Computer Science and Engineering, Indian Institute of Technology Delhi. {rjaiswal A simple D 2 -sampling based PTAS for k-means and other Clustering problems Ragesh Jaiswal1 , Amit Kumar1 , and Sandeep Sen1 Department of Computer Science and Engineering, Indian Institute of Technology Delhi. {rjaiswal](https://www.pdfsearch.io/img/782369534a6a925e24ec45cec380b524.jpg) | Add to Reading ListSource URL: www.cse.iitd.ernet.inLanguage: English - Date: 2013-02-10 01:14:54
|
---|